Sampling for the V-line transform with vertex on a circle
نویسندگان
چکیده
In this paper, we consider a special V-line transform. It integrates given function f over the V-lines whose centers are on circle centered at origin and symmetric axes pass through origin. We derive two sampling scheme of transform: standard interlaced ones. prove an error estimate for schemes, which is explicitly expressed in term f.
منابع مشابه
On the V-Line Radon Transform and Its Imaging Applications
Radon transforms defined on smooth curves are well known and extensively studied in the literature. In this paper, we consider a Radon transform defined on a discontinuous curve formed by a pair of half-lines forming the vertical letter V. If the classical two-dimensional Radon transform has served as a work horse for tomographic transmission and/or emission imaging, we show that this V-line Ra...
متن کاملdeveloping a pattern based on speech acts and language functions for developing materials for the course “ the study of islamic texts translation”
هدف پژوهش حاضر ارائه ی الگویی بر اساس کنش گفتار و کارکرد زبان برای تدوین مطالب درس "بررسی آثار ترجمه شده ی اسلامی" می باشد. در الگوی جدید، جهت تدوین مطالب بهتر و جذاب تر، بر خلاف کتاب-های موجود، از مدل های سطوح گفتارِ آستین (1962)، گروه بندی عملکردهای گفتارِ سرل (1976) و کارکرد زبانیِ هالیدی (1978) بهره جسته شده است. برای این منظور، 57 آیه ی شریفه، به صورت تصادفی از بخش-های مختلف قرآن انتخاب گردید...
15 صفحه اولThe Coherent Circle Hough Transform
We introduce a novel formulation of the Circle Hough Transform that we call the Coherent Circle Hough Transform. The technique uses phase to code for radii of circles. The usual simplifications of the Circle Hough Transform (CHT) are used in which lines pointing away from edge points are plotted rather than circles. Intersections of these "spokes" accumulate edge magnitude, or edge "energy", ne...
متن کاملTight Bounds on Vertex Connectivity Under Vertex Sampling
A fundamental result by Karger [10] states that for any λ-edgeconnected graph with n nodes, independently sampling each edge with probability p = Ω(logn/λ) results in a graph that has edge connectivity Ω(λp), with high probability. This paper proves the analogous result for vertex connectivity, when sampling vertices. We show that for any k-vertex-connected graph G with n nodes, if each node is...
متن کاملThe robust vertex centdian location problem with interval vertex weights on general graphs
In this paper, the robust vertex centdian location problem with uncertain vertex weights on general graphs is studied. The used criterion to solve the problem is the min-max regret criterion. This problem is investigated with objective function contains $lambda$ and a polynomial time algorithm for the problem is presented. It is shown that the vertex centdian problem on general graphs i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Inverse Problems
سال: 2021
ISSN: ['0266-5611', '1361-6420']
DOI: https://doi.org/10.1088/1361-6420/ac03a2